Coinductive Program Verification - Thesis Proposal

نویسنده

  • Brandon Moore
چکیده

Every programming language should have a formal semantics, and sound verification tools. Giving an operational semantics is hardly more difficult than writing an interpreter, but traditional approaches to enabling program verification, such as defining and proving sound an axiomatic semantics, require considerably more sophistication. For maximum confidence, a program verification tool should be proven sound, or at least produce proof certificate in a standard proof system showing that a validated formal semantics for the language implies that the program has the claimed properties. The standard approach is to define an operational semantics for a language, and then define and prove equivalent an alternate semantics more suitable for verification, such as an axiomatic semantics. We believe it is unnecessary to define language-specific proof systems, that certain simple coinductive semantics can make reasoning about programs directly in terms of an operational semantics simple, effective, and powerful.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Coinductive Verification of Program Optimizations Using Similarity Relations

Formal verification methods have gained increased importance due to their ability to guarantee system correctness and improve reliability. Nevertheless, the question how proofs are to be formalized in theorem provers is far from being trivial, yet very important as one needs to spend much more time on verification if the formalization was not cleverly chosen. In this paper, we develop and compa...

متن کامل

Verifying Complex Continuous Real-Time Systems with Coinductive CLP(R)

Timed automata has been used as a powerful formalism for specifying, designing, and analyzing real time systems. We consider the generalization of timed automata to Pushdown Timed Automata (PTA). We show how PTAs can be elegantly modeled via logic programming extended with coinduction and constraints over reals. We use this logic programming realization of a PTA to develop an elegant solution t...

متن کامل

Coinductive unwinding of security-relevant hyperproperties: extended version

Unwinding relations have been widely used to prove that finite systems are secure with respect to a variety of noninterference policies. The latter are prominent instances of security-relevant hyperproperties. As hyperproperties are defined on potentially infinite systems, a new mathematical development is needed in order to (re)use unwinding relations for generic verification of securityreleva...

متن کامل

Viewpoints of Supervisors about the Problems in the Process of Dissertations for General Medicine Program Isfahan University of Medical Sciences

Introduction. To improve the quality of dissertations (as a mandatory course) in general medicine (MD) program, it is useful to know the viewpoints of supervisors about different issues and problems in their supervision process, i.e. the objectives of the course, facilitation methods for learning, problems of the practical phase, and their ideas about the course efficacy. This study explores su...

متن کامل

Abstract compilation of object-oriented languages into coinductive CLP(X): when type inference meets verification

compilation of object-oriented languages into coinductive CLP(X): when type inference meets verification Davide Ancona, Andrea Corradi, Giovanni Lagorio, and Ferruccio Damiani 1 DISI, University of Genova, Italy {davide,lagorio}@disi.unige.it,[email protected] 2 Dipartimento di Informatica, University of Torino, Italy

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013